# -*- coding: utf-8 -*-
def InsertSort(arr):
    n = len(arr)
    if n == 1:
        return 1
    for i in range(1, n):
        c1 = arr[i]
        j = i
        while j > 0 and c1 < arr[j-1]:
            arr[j] = arr[j-1]
            j -= 1
        arr[j] = c1
        
l2 = [9,3,1,5,6]
InsertSort(l2)
print(l2)
